11276_2007_45_14_5-web

Source URL: disco.ethz.ch

• Graph theory
• Routing algorithms
• Mathematics
• Computing
• Wireless networking
• Routing protocols
• Network theory
• Edsger W. Dijkstra
• Geographic routing
• Shortest path problem
• Routing
• Unit disk graph

Are Elephants Bigger than Butterflies? Reasoning about Sizes of Objects Hessam Bagherinezhad† and Hannaneh Hajishirzi† and Yejin Choi† and Ali Farhadi†‡ † University of Washington, ‡ Allen Institute for AI

Source URL: ai2-website.s3.amazonaws.com

• Graph theory
• Graph
• Line graph
• Size
• Minimum spanning tree
• Image segmentation
• Akaike information criterion
• Conference on Computer Vision and Pattern Recognition
• Binary star

Analysis of a forwarding game without payments George Karakostas McMaster University Abstract—We consider a forwarding game on directed graphs

Source URL: www.cas.mcmaster.ca

• Graph theory
• Mathematics
• Discrete mathematics
• Network flow
• Flow network
• Operations research
• Directed graph
• Nash equilibrium
• Routing
• Networks
• Wireless ad hoc network
• Maximum flow problem

On Consistent Migration of Flows in SDNs Sebastian Brandt Klaus-Tycho Foerster∗ Roger Wattenhofer

Source URL: www.tik.ee.ethz.ch

• Network flow
• Graph theory
• Mathematics
• Operations research
• Flow network
• Multi-commodity flow problem
• Maximum flow problem
• Max-flow min-cut theorem
• Traffic flow
• Linear programming
• Approximate max-flow min-cut theorem
• Circulation problem

XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks Roger Wattenhofer and Aaron Zollinger {wattenhofer, zollinger}@inf.ethz.ch Department of Computer Science, ETH Zurich 8092 Zurich, Switzerland

Source URL: disco.ethz.ch

• Graph theory
• Mathematics
• NP-complete problems
• Spanning tree
• Edsger W. Dijkstra
• Routing algorithms
• Search algorithms
• Topology control
• Unit disk graph
• Connectivity
• Minimum spanning tree
• Bipartite graph

Constrained Level Generation through Grammar-Based Evolutionary Algorithms Jose M. Font*1 , Roberto Izquierdo2 , Daniel Manrique2 , and Julian Togelius3 1 U-tad, Centro Universitario de Tecnolog´ıa y Arte Digital, C/P

Source URL: julian.togelius.com

• Graph theory
• Procedural generation
• Cycle
• Graph coloring
• NP-complete problems
• Book:Graph Theory

An Introduction to Algebraic Graph Theory Rob Beezer, SCU ’78 Department of Mathematics and Computer Science University of Puget Sound

Source URL: buzzard.ups.edu

Network Vulnerability: A Designer-Disruptor Game∗ Hans Haller† FebruaryAbstract

Source URL: www.econ.vt.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Multigraph
• Flow network
• Graph
• A* search algorithm

MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Accelerated graph-based spectral polynomial filters Knyazev, A.; Malyshev, A. TR2015-106

Source URL: www.merl.com

• Numerical linear algebra
• Filter theory
• LOBPCG
• Bilateral filter
• Filter
• Electronic filter
• Non-local means
• Noise reduction
• Iterative method
• Linear filter
• Photographic filter
• Preconditioner

MINING LARGE GRAPHS David F. Gleich, Michael W. Mahoney 1 introduction Graphs provide a general representation or data model for many types of data where pair-wise relationships are known or thought to be particularly im

Source URL: www.stat.berkeley.edu

• Graph theory
• Algebraic graph theory
• Graph
• Neighbourhood
• Adjacency list
• Centrality
• Adjacency matrix
• Implicit graph
• Bipartite graph